منابع مشابه
Busy beavers gone wild
When considering a class of Turing machines that halt when started from a blank tape, busy beavers for that class, as coined by Tibor Radó, are those Turing machines which eventually halt after the maximum number of steps (or after producing the maximum number of non-blank symbols). Finding for a class of Turing machines the busy beaver champion (for any of the two competitions) is of course un...
متن کاملThe Quest for Busy Beavers
In this chapter we study the feasibility of using Turing Machines as a model for the evolution of computer programs. To assess this idea we select, as test problem, the Busy Beaver — a well-known theoretical problem of undisputed interest and difficulty proposed by Tibor Rado in 1962. We focus our research on representational issues and on the development of specific genetic operators, proposin...
متن کاملBusy Beavers and Kolmogorov Complexity
The idea to find the “maximal number that can be named” can be traced back to Archimedes (see his Psammit [1]). From the viewpoint of computation theory the natural question is “which number can be described by at most n bits”? This question led to the definition of the so-called “busy beaver” numbers (introduced by T. Rado). In this note we consider different versions of the busy beaver-like n...
متن کامل(Preliminary Version) Evolutionary Turing Machines – The Quest for Busy Beavers
In this chapter we study the feasibility of using Turing Machines as a model for the evolution of computer programs. To assess this idea we select, as test problem, the Busy Beaver a well-known theoretical problem of undisputed interest and difficulty proposed by Tibor Rado in 1962. We focus our research on representational issues and on the development of specific genetic operators, proposing ...
متن کاملThe Influence of Learning in the Evolution of Busy Beavers
The goal of this research is to study how individual learning interacts with an evolutionary algorithm in its search for good candidates for the Busy Beaver problem. Two learning models, designed to act as local search procedures, are proposed. Experimental results show that local search methods that are able to perform several modifications in the structure of an individual in each learning st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2009
ISSN: 2075-2180
DOI: 10.4204/eptcs.1.12